Tootfinder

Proof complexity of universal algebra in a CSP dichotomy proof
Azza Gaysin
https://arxiv.org/abs/2403.06704 https://arxiv.org/pdf/240…

Proof complexity of universal algebra in a CSP dichotomy proof
The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to $\mathcal{A}$. For years, it has been conjectured that all problems of this type are divided into polynomial-time and NP-complete problems, and the conjecture was proved in 2017 separately by Zhuk (2017) and Bulatov (2017). Zhuk's algorithm solves tractable …

Domain Reasoning in TopKAT
Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi
https://arxiv.org/abs/2404.18417 https://arxiv.org/p…

Domain Reasoning in TopKAT
TopKAT is the algebraic theory of Kleene algebra with tests (KAT) extended with a top element. Compared to KAT, one pleasant feature of TopKAT is that, in relational models, the top element allows us to express the domain and codomain of a relation. This enables several applications in program logics, such as proving under-approximate specifications or reachability properties of imperative programs. However, while TopKAT inherits many pleasant features of KATs, such as having a decidable equati…

This https://arxiv.org/abs/2312.02572 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDB_…

Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers
Query optimizers built on the transformation-based Volcano/Cascades framework are used in many database systems. Transformations proposed earlier on the logical query dag (LQDAG) data structure, which is key in such a framework, focus only on recursion-free queries. In this paper, we propose the recursive logical query dag (RLQDAG) which extends the LQDAG with the ability to capture and transform recursive queries, leveraging recent developments in recursive relational algebra. Specifically, th…

This https://arxiv.org/abs/2312.02572 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDB_…

Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers
Query optimizers built on the transformation-based Volcano/Cascades framework are used in many database systems. Transformations proposed earlier on the logical query dag (LQDAG) data structure, which is key in such a framework, focus only on recursion-free queries. In this paper, we propose the recursive logical query dag (RLQDAG) which extends the LQDAG with the ability to capture and transform recursive queries, leveraging recent developments in recursive relational algebra. Specifically, th…

This https://arxiv.org/abs/2312.04282 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDB_…

Adaptive Recursive Query Optimization
Performance-critical industrial applications, including large-scale program, network, and distributed system analyses, are increasingly reliant on recursive queries for data analysis. Yet traditional relational algebra-based query optimization techniques do not scale well to recursive query processing due to the iterative nature of query evaluation, where relation cardinalities can change unpredictably during the course of a single query execution. To avoid error-prone cardinality estimation, a…